Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations

نویسندگان

  • Allal Guessab
  • Gerhard Schmeisser
چکیده

Let ⊂ Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal properties of those positive definite formulae that can be generated by a centroidal Voronoi tessellation of . In this connection we come across a class of operators of the form Ln[ f ](x) := ∑n i=1 φi(x)( f (yi)+ 〈∇ f (yi), x − yi〉), where y1, . . . , yn are distinct points in and {φ1, . . . , φn} is a partition of unity on . We present best possible pointwise error estimates and describe operators Ln with a smallest constant in an Lp error estimate for 1 ≤ p < ∞. For a generalization, we introduce a new type of Voronoi tessellation in terms of a twice continuously differentiable and strictly convex function f . It allows us to describe a best operator Ln for approximating f by Ln[ f ] with respect to the Lp norm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations

A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...

متن کامل

2D Centroidal Voronoi Tessellations with Constraints

We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges. The clipping itself i...

متن کامل

Ideal Point Distributions, Best Mode Selections and Optimal Spatial Partitions via Centroidal Voronoi Tessellations

There are many new applications of the centroidal Voronoi tessellations that come to life in recent years, along with more mathematical understandings and new algorithmic advances in their efficient computation. Some examples are presented in this paper as an illustration with an emphasis on the construction of ideal point distributions, best mode selections and optimal spatial partitions.

متن کامل

Random tessellations and Cox processes

We consider random tessellations T in R2 and Coxian point processes whose driving measure is concentrated on the edges of T . In particular, we discuss several classes of Poisson-type tessellations which can describe e.g. the infrastructure of telecommunication networks, whereas the Cox processes on their edges can describe the locations of network components. An important quantity associated w...

متن کامل

Inverting Laguerre Tessellations

A Laguerre tessellation is a generalization of a Voronoi tessellation where the proximity between points is measured via a power distance rather than the Euclidean distance. Laguerre tessellations have found significant applications in materials science, providing improved modeling of (poly)crystalline microstructures and grain growth. There exist efficient algorithms to construct Laguerre tess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Adv. Comput. Math.

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2010